MacColl’s influences on Peirce and Schröder
نویسندگان
چکیده
منابع مشابه
Peirce and Frege on Logic
Though Peirce and Frege played crucial roles in the development of modern logic, there has been so far little scholarly work comparing their positions on the nature of logic. I offer here a comparative study of their views on logic and I show that, although they developed their views independently from each other and with very different projects in mind, their positions are extremely similar (e...
متن کامل2486 on Delannoy Numbers and Schröder Numbers
The nth Delannoy number and the nth Schröder number given by D n = n k=0 n k n + k k and S n = n k=0 n k n + k k 1 k + 1 respectively arise naturally from enumerative combinatorics. Let p be an odd prime. We mainly show that p−1 k=1 D k k 2 ≡ 2 −1 p E p−3 (mod p) and p−1 k=1 S k m k ≡ m 2 − 6m + 1 2m 1 − m 2 − 6m + 1 p (mod p), where (−) is the Legendre symbol, E 0 , E 1 , E 2 ,. .. are Euler n...
متن کامل, Dominique Schröder , and
A functional credential allows a user to anony-mously prove possession of a set of attributes that fulfillsa certain policy. The policies are arbitrary polynomiallycomputable predicates that are evaluated over arbitraryattributes. The key feature of this primitive is the dele-gation of verification to third parties, called designatedverifiers. The delegation protects the...
متن کاملOn the Diagram of Schröder Permutations
Egge and Mansour have recently studied permutations which avoid 1243 and 2143 regarding the occurrence of certain additional patterns. Some of the open questions related to their work can easily be answered by using permutation diagrams. As for 132-avoiding permutations the diagram approach gives insights into the structure of {1243, 2143}-avoiding permutations that yield simple proofs for some...
متن کاملGeneralized Small Schröder Numbers
We study generalized small Schröder paths in the sense of arbitrary sizes of steps. A generalized small Schröder path is a generalized lattice path from (0, 0) to (2n, 0) with the step set of {(k, k), (l,−l), (2r, 0) | k, l, r ∈ P}, where P is the set of positive integers, which never goes below the x-axis, and with no horizontal steps at level 0. We find a bijection between 5-colored Dyck path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophia Scientae
سال: 2011
ISSN: 1281-2463,1775-4283
DOI: 10.4000/philosophiascientiae.366